Least-norm linear programming solution as an unconstrained minimization problem
نویسندگان
چکیده
منابع مشابه
Linear Programming and l1-Norm Minimization Problems with Convolution Constraints
We illustrate some recent results on exact solutions to discrete-time l1-norm minimization problems with convolution constraints. A fixed-point property for this class of problems is introduced. The convolution constraints can be interpreted as a dynamic system with initial conditions. We show by construction that optimal solutions with a rational Z-transform exist for any initial conditions sa...
متن کاملAn L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...
متن کاملAn Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
In this paper, an unconstrained convex programming dual approach for solving a class of linear semi-infinite programming problems is proposed. Both primal and dual convergence results are established under some basic assumptions. Numerical examples are also included to illustrate this approach.
متن کاملAn unconstrained convex programming view of linear programming
The major interest of this paper is to show that, at least in theory, a pair of primal and dual "e-optimal solutions" to a general linear program in Karmarkar's standard form can be obtained by solving an unconstrained convex program. Hence unconstrained convex optimization methods are suggested to be carefully reviewed for this purpose.
متن کاملUnconstrained inverse quadratic programming problem
The paper covers a formulation of the inverse quadratic programming problem in terms of unconstrained optimization where it is required to find the unknown parameters (the matrix of the quadratic form and the vector of the quasi-linear part of the quadratic form) provided that approximate estimates of the optimal solution of the direct problem and those of the target function to be minimized in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1983
ISSN: 0022-247X
DOI: 10.1016/0022-247x(83)90283-4